Convergence and rate of convergence of some greedy algorithms in convex optimization
نویسندگان
چکیده
منابع مشابه
the investigation of research articles in applied linguistics: convergence and divergence in iranian elt context
چکیده ندارد.
Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees
Greedy optimization methods such as Matching Pursuit (MP) and Frank-Wolfe (FW) algorithms regained popularity in recent years due to their simplicity, effectiveness and theoretical guarantees. MP and FW address optimization over the linear span and the convex hull of a set of atoms, respectively. In this paper, we consider the intermediate case of optimization over the convex cone, parametrized...
متن کاملFuzzy convergence structures in the framework of L-convex spaces
In this paper, fuzzy convergence theory in the framework of $L$-convex spaces is introduced. Firstly, the concept of $L$-convex remote-neighborhood spaces is introduced and it is shown that the resulting category is isomorphic to that of $L$-convex spaces. Secondly, by means of $L$-convex ideals, the notion of $L$-convergence spaces is introduced and it is proved that the category of $L$-con...
متن کاملConvergence of trajectories in infinite horizon optimization
In this paper, we investigate the convergence of a sequence of minimizing trajectories in infinite horizon optimization problems. The convergence is considered in the sense of ideals and their particular case called the statistical convergence. The optimality is defined as a total cost over the infinite horizon.
متن کاملConvergence Rates for Greedy Kaczmarz Algorithms
We discuss greedy and approximate greedy selection rules within Kaczmarz algorithms for solving linear systems. We show that in some applications the costs of greedy and randomized rules are similar, and that greedy selection gives faster convergence rates. Further, we give a multi-step analysis of a particular greedy rule showing it can be much faster when many rows are orthogonal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Steklov Institute of Mathematics
سال: 2016
ISSN: 0081-5438,1531-8605
DOI: 10.1134/s0081543816040222